Heuristic allocation based on a dynamic programming state-space representation
نویسندگان
چکیده
منابع مشابه
Recursive Dynamic Programming: Heuristic Rules, Bounding and State Space Reduction
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning ...
متن کاملHeuristic dynamic programming with internal goal representation
In this paper, we analyze an internal goal structure based on heuristic dynamic programming, named GrHDP, to tackle the 2-D maze navigation problem. Classical reinforcement learning approaches have been introduced to solve this problem in literature, yet no intermediate reward has been assigned before reaching the final goal. In this paper, we integrated one additional network, namely goal netw...
متن کاملA tabu search heuristic for the dynamic space allocation problem
The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distan...
متن کاملDynamic Programming for POMDPs Using a Factored State Representation
Contingent planning -constructing a plan in which action seh,ction is contingent on imperfect infornlation received during plan execution can be forma]ized ~s the problem of solving a partially observabh, Markov decision process (POMDP). Traditional dynamic programmiug algorittmm for POMDPs use a flat state representation that enunmrat(.s all possible states au,l staCe tr~msitions. By contrast,...
متن کاملApproximate dynamic programming based on high dimensional model representation
This article introduces an algorithm for implicit High Dimensional Model Representation (HDMR) of the Bellman equation. This approximation technique reduces memory demands of the algorithm considerably. Moreover, we show that HDMR enables fast approximate minimization which is essential for evaluation of the Bellman function. In each time step, the problem of parametrized HDMR minimization is r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2002
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(01)00599-4